Local boundedness of weak solutions to the Diffusive Wave Approximation of the Shallow Water equations

In this paper we prove that weak solutions to the Diffusive Wave Approximation of the Shallow Water equations

${?}_{t}u?\mathrm{?}?({(u?z)}^{\alpha }|\mathrm{?}u{|}^{\gamma ?1}\mathrm{?}u)=f$

are locally bounded. Here, u describes the height of the water, z is a given function that represents the land elevation and f is a source term accounting for evaporation, infiltration or rainfall.     

Pentapnictogen heterocyclic monoanions: Structure,stability, and aromaticity

Inorganic planar ring-shape molecules with 4n + 2 π electrons are always the focus of experimental synthesis and theoretical research due to their potential aromaticity and stability. In this work, the whole series of five-membered heterocycle monoanions X _nY_5-n⁻ (X, Y = group 15 elements; n = 1-4) were thoroughly investigated by means of density functional theory calculations. They all have large formation energies and HOMO-LUMO gap energies, suggesting the potential thermodynamic and kinetic stability. Their aromaticities are comparable to that of typical aromatic hydrocarbons. Their thermal stabilities were firmly established by the ab initio molecular dynamics simulations. As most of them are predicted for the first time, their various spectra were simulated for experimental characterization. Furthermore, we demonstrate that these five-membered cyclic anions can be employed as η⁵-ligand to construct novel all-inorganic metallocenes, which may serve as the building blocks of low-dimensional nanomaterials.     

Injective and automorphism-invariant non-singular modules

Every automorphism-invariant non-singular right A-module is injective if and only if the factor ring of the ring A with respect to its right Goldie radical is a right strongly semiprime ring.     

Maximal Subrings and Covering Numbers of Finite Semisimple Rings

We classify the maximal subrings of the ring of n×n matrices over a finite field, and show that these subrings may be divided into three types. We also describe all of the maximal subrings of a finite semisimple ring, and categorize them into two classes. As an application of these results, we calculate the covering number of a finite semisimple ring.     

Vertex-disjoint cycles in local tournaments

Let $r$ be a positive integer. The Bermond–Thomassen conjecture states that, a digraph of minimum out-degree at least $2r-1$ contains $r$ vertex-disjoint directed cycles. A digraph $D$ is called a local tournament if for every vertex $x$ of $D$, both the out-neighbours and the in-neighbours of $x$ induce tournaments. Note that tournaments form the subclass of local tournaments. In this paper, we verify that the Bermond–Thomassen conjecture holds for local tournaments. In particular, we prove that every local tournament $D$ with ${\delta }^{+}\left(D\right)\ge 2r-1$ contains $r$ disjoint cycles $C_1,C_2,\dots ,C_r$, satisfying that either $C_i$ has the length at most 4 or is a shortest cycle of the original digraph of $D-C_1-\dots -C_{i-1}$ for $1\le i\le r$.     

Potts models with magnetic field: Arithmetic,geometry, and computation

We give a sheaf theoretic interpretation of Potts models with external magnetic field, in terms of constructible sheaves and their Euler characteristics. We show that the polynomial countability question for the hypersurfaces defined by the vanishing of the partition function is affected by changes in the magnetic field: elementary examples suffice to see non-polynomially countable cases that become polynomially countable after a perturbation of the magnetic field. The same recursive formula for the Grothendieck classes, under edge-doubling operations, holds as in the case without magnetic field, but the closed formulae for specific examples like banana graphs differ in the presence of magnetic field. We give examples of computation of the Euler characteristic with compact support, for the set of real zeros, and find a similar exponential growth with the size of the graph. This can be viewed as a measure of topological and algorithmic complexity. We also consider the computational complexity question for evaluations of the polynomial, and show both tractable and NP-hard examples, using dynamic programming.